Sparse Regular Random Graphs: Spectral Density and Eigenvectors
نویسنده
چکیده
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of vertices, the empirical spectral distribution converges to the semicircle law. Moreover, we prove concentration estimates on the number of eigenvalues over progressively smaller intervals. We also show that, with high probability, all the eigenvectors are delocalized.
منابع مشابه
Eigenvector Statistics of Sparse Random Matrices
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of ErdősRényi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the graphs. Our methodology follows [6] by analyzing the eigenvector flow under Dyson Brownian motion, combining with an isotropic local law for Green’s function. As an...
متن کاملSpectral density of the non-backtracking operator
The non-backtracking operator was recently shown to provide a significant improvement when used for spectral clustering of sparse networks. In this paper we analyze its spectral density on large random sparse graphs using a mapping to the correlation functions of a certain interacting quantum disordered system on the graph. On sparse, tree-like graphs, this can be solved efficiently by the cavi...
متن کاملSparse random graphs: Eigenvalues and eigenvectors
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial.
متن کاملSpectra of sparse random matrices
We compute the spectral density for ensembles of of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of the one suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaus...
متن کاملSpectral measures of random graphs
These lecture notes are devoted to the spectral analysis of adjacency operators of graphs and random graphs. With the notion of unimodular random graphs, it is possible to define a natural notion of average spectral measure which corresponds to the density of states in the language of mathematical physics, to the Plancherel measure for Cayley graphs and, for finite graphs, to the empirical meas...
متن کامل